Analysis of Bu er Replacement Policies for WWW
نویسندگان
چکیده
The advent of the Web service brought out the explosive growth of Internet, which necessitates a scheme to reduce the netwrok traac. Caching is a popular method in reducing such traac, and it is widely used in many Web servers, clients, and proxy servers. Since an object of Web service is accessed as a whole, the caching scheme for such object must be diierent from others that usually treat a piece of an object as a unit of caching. In this paper, we propose caching schemes for variable size objects. Performance of the proposed schemes are explored through trace-driven simulation studies.
منابع مشابه
Bu er Sharing in Shared Memory ATM Systems With Space Priority Tra c
In this paper we study the problem of the optimal design of bu er management policies for a shared memory ATM switch or demultiplexer fed by tra c containing two different space priorities. We present the properties of the optimal policy within the class of pushout and expelling policies that minimizes total weighted cell loss. A numerical study of the optimal policies for small bu er sizes bas...
متن کاملIssues in the design of store buffers in dynamically scheduled processors
Processor performance can be sensitive to load-store ordering, memory bandwidth, and memory access latency. A store bu er is a mechanism that exists in many current processors to accomplish one or more of the following: store access ordering, latency hiding, and data forwarding. Di erent policies that govern store bu er behavior can a ect overall processor performance. However, the performance ...
متن کاملThe Multi-Queue Replacement Algorithm for Second Level Buffer Caches
This paper reports our research results that improve second level bu er cache performance. Several previous studies have shown that a good single level cache replacement algorithm such as LRU does not work well with second level bu er caches. Second level bu er caches have di erent access pattern from rst level bu er caches because Accesses to second level bu er caches are actually misses from ...
متن کاملAdvanced Replacement Policies for WWW Caching
WWW caching necessitates advanced replacement policies that include sophisticated control logic and efficient contents management. This paper presents a constructive approach for the design and analysis of such advanced policies. Based on this approach, we develop a new caching policy, namely, PSSW. Trace-driven simulations show PSS-W outperforms most contemporary policies in both hit rates and...
متن کاملAsymptotic Buuer Overrow Probabilities in Multiclass Multiplexers: an Optimal Control Approach 1
We consider a multiclass multiplexer with support for multiple service classes, and dedicated bu ers for each service class. Under speci c scheduling policies for sharing bandwidth among these classes, we seek the asymptotic (as the bu er size goes to in nity) tail of the bu er over ow probability for each dedicated bu er. We assume dependent arrival and service processes as is usually the case...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007